An inexact hybrid projection–proximal point algorithm for solving generalized mixed variational inequalities
نویسندگان
چکیده
منابع مشابه
A projective splitting algorithm for solving generalized mixed variational inequalities
* Correspondence: fuquanxia@sina. com Department of Mathematics, Sichuan Normal University, Chengdu, Sichuan 610066, P. R. China Full list of author information is available at the end of the article Abstract In this paper, a projective splitting method for solving a class of generalized mixed variational inequalities is considered in Hilbert spaces. We investigate a general iterative algorithm...
متن کاملAn inexact proximal algorithm for variational inequalities
This paper presents a new inexact proximal method for solving monotone variational inequality problems with a given separable structure. The resulting method combines the recent proximal distances theory introduced by Auslender and Teboulle (2006) with a decomposition method given by Chen and Teboulle that was proposed to solve convex optimization problems. This method extends and generalizes p...
متن کاملAn Iterative Algorithm for Generalized Mixed Equilibria with Variational Inequalities
In this paper, we shall introduce an iterative algorithm by multi-step implicit hybrid steepestdescent method for finding a common element of the set of solutions of a finite family of generalized mixed equilibrium problems, the set of solutions of a finite family of variational inequalities for inverse strongly monotone mappings and the set of fixed points of a countable family of nonexpansive...
متن کاملAn Inexact Proximal Algorithm for Pseudomonotone and Quasimonotone Variational Inequalities
In this paper we introduce an inexact proximal point algorithm using proximal distances for solving variational inequality problems when the mapping is pseudomonotone or quasimonotone. Under some natural assumptions we prove that the sequence generates by the algorithm is convergent for the pseudomonotone case and weakly convergent for the quasimonotone ones. This approach unifies the results o...
متن کاملAn inexact proximal point method for solving generalized fractional programs
In this paper, we present several new implementable methods for solving a generalized fractional program with convex data. They are Dinkelbach-type methods where a prox-regularization term is added to avoid the numerical difficulties arising when the solution of the problem is not unique. In these methods, at each iteration a regularized parametric problem is solved inexactly to obtain an appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.10.042